Scalable workflow scheduling algorithm for minimizing makespan and failure probability
نویسندگان
چکیده
منابع مشابه
Multi-objective and Scalable Heuristic Algorithm for Workflow Task Scheduling in Utility Grids
To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...
متن کاملSurvivability and Makespan Driven Scheduling Algorithm for Grid Workflow Applications
With the development of Grid technologies, scientists and engineers obtain large computing capability to execute large-scale workflow applications. However the Grids also bring a troublesome problem. In the dynamic, complex and unbounded Grid systems, malicious attacks and hardware faults, which are inevitable, can have a serious effect on the execution of applications. Therefore it is necessar...
متن کاملmulti-objective and scalable heuristic algorithm for workflow task scheduling in utility grids
to use services transparently in a distributed environment, the utility grids develop a cyber-infrastructure. the parameters of the quality of service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the utility grids. optimization of both target parameters above is a challenge in a distributed environment and may conflict one ano...
متن کاملApproximation Algorithm of Minimizing Makespan in Parallel Bounded Batch Scheduling∗
We consider the problem of minimizing the makespan(Cmax) on m identical parallel batch processing machines. The batch processing machine can process up to B jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same time. For a batch of jobs, the processing time of the batch is equal to the largest processing time among the job...
متن کاملA Branch-and-Bound Based Heuristic Algorithm for Minimizing Makespan in Machining-Assembly Flowshop Scheduling
This paper proposes a heuristic algorithm, called list-based squeezing branch and bound algorithm, for solving a machine-fixed, machining-assembly flowshop scheduling problem to minimize makespan. The machine-fixed, machining-assembly flowshop consists of some parallel two-machine flow lines at a machining stage and one robot at an assembly stage. Since an optimal schedule for this problem is n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Electrical Engineering and Informatics
سال: 2019
ISSN: 2302-9285,2089-3191
DOI: 10.11591/eei.v8i1.1436